A complete characterization of pretty good state transfer on paths
نویسندگان
چکیده
منابع مشابه
Pretty Good State Transfer on Circulant Graphs
Let G be a graph with adjacency matrix A. The transition matrix of G relative to A is defined by H(t) := exp (−itA), where t ∈ R. The graph G is said to admit pretty good state transfer between a pair of vertices u and v if there exists a sequence of real numbers {tk} and a complex number γ of unit modulus such that lim k→∞ H(tk)eu = γev. We find that the cycle Cn as well as its complement Cn a...
متن کاملSatisficing: A ‘Pretty Good’ Heuristic
One of the best known ideas in the study of bounded rationality is Simon’s satisficing; yet we still lack a standard formalization of the heuristic and its implications. We propose a mathematical model of satisficing which explicitly represents agents’ aspirations and which explores both singleperson and multi-player contexts. The model shows that satisficing has a signature performanceprofile ...
متن کاملA Pretty Good Formatting Pipeline
Proper formatting makes the structure of a program apparent and aids program comprehension. The need to format code arises in code generation and transformation, as well as in normal reading and editing situations. Commonly used pretty-printing tools in transformation frameworks provide an easy way to produce indented code that is fairly readable for humans, without reaching the level of purpos...
متن کاملPretty Good Gravity
A theory of topological gravity is a homotopy-theoretic representation of the Segal-Tillmann topologification of a two-category with cobordisms as morphisms. This note describes a relatively accessible example of such a thing, suggested by the wall-crossing formulas of Donaldson theory. 1. Gravity categories A cobordism category has manifolds as objects, and cobordisms as morphisms. Such catego...
متن کاملPretty Good Democracy
Code voting seeks to address the issues of privacy and integrity for Remote Internet Voting. It sidesteps many of the inherent vulnerabilities of the Internet and client platforms but it does not provide end-to-end verification that votes are counted as cast. In this paper, we propose a simple technique to enhance the verifiability of code voting by ensuring that the Vote Server can only access...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Quantum Information and Computation
سال: 2019
ISSN: 1533-7146,1533-7146
DOI: 10.26421/qic19.7-8-5